package demo.practice.leetcode_eveyday;

public class P461 {

    public int hammingDistance(int x, int y) {
        int rox = x ^ y;
        int sum = 0;
        while (rox > 0) {
            sum += rox & 1;
            rox >>= 1;
        }
        return sum;
    }
}
